Turán's theorem and k-connected graphs
نویسندگان
چکیده
The minimum size of a k-connected graph with given order and stability number is investigated. If no connectivity is required, the answer is given by Turán’s Theorem. For connected graphs, the problem has been solved recently independently by Christophe et al., and by Gitler and Valencia. In this paper, we give a short proof of their result and determine the extremal graphs. We settle the case of 2-connected graphs, characterize the corresponding extremal graphs, and also extend a result of Brouwer related to Turán’s Theorem. c © (Year) John Wiley & Sons, Inc.
منابع مشابه
Turán's theorem in sparse random graphs
We prove the analogue of Turán’s Theorem in random graphs with edge probability p(n) À n−1/(k−1.5). With probability 1 − o(1), one needs to delete approximately 1 k−1–fraction of the edges in a random graph in order to destroy all cliques of size k.
متن کاملComplete subgraphs in multipartite graphs
Turán’s Theorem states that every graphG of edge density ‖G‖/ (|G| 2 ) > k−2 k−1 contains a complete graph K and describes the unique extremal graphs. We give a similar Theorem for `-partite graphs. For large `, we find the minimal edge density d` , such that every `-partite graph whose parts have pairwise edge density greater than d` contains a K . It turns out that d` = k−2 k−1 for large enou...
متن کاملSieve methods in combinatorics
We develop the Turán sieve and a ‘simple sieve’ in the context of bipartite graphs and apply them to various problems in combinatorics. More precisely, we provide applications in the cases of characters of abelian groups, vertex-colourings of graphs, Latin squares, connected graphs, and generators of groups. In addition, we give a spectral interpretation of the Turán sieve. © 2004 Elsevier Inc....
متن کاملCritical graphs without triangles: An optimum density construction
We construct dense, triangle-free, chromatic-critical graphs of chromatic number k for all k ≥ 4. For k ≥ 6 our constructions have > ( 1 4 −ε)n edges, which is asymptotically best possible by Turán’s theorem. We also demonstrate (nonconstructively) the existence of dense k-critical graphs avoiding all odd cycles of length ≤ l for any l and any k ≥ 4, again with a best possible density of > ( 1 ...
متن کاملTurán’s theorem with colors
We consider a generalization of Turán’s theorem for edge-colored graphs. Suppose that R (red) and B (blue) are graphs on the same vertex set of size n. We conjecture that if R and B each have more than (1− 1/k)n/2 edges, and K is a (k+ 1)-clique whose edges are arbitrarily colored with red and blue, then R ∪B contains a colored copy of K, for all k + 1 6∈ {4, 6, 8}. If k + 1 ∈ {4, 6, 8}, then t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 58 شماره
صفحات -
تاریخ انتشار 2008